package com.person.leetcode.editor.cn;

/**
  * 1770.执行乘法运算的最大分数
  * 2022-07-12 14:40:16
**/
public class Sequence_1770_MaximumScoreFromPerformingMultiplicationOperations {
    public static void main(String[] args) {
        Solution solution = new Sequence_1770_MaximumScoreFromPerformingMultiplicationOperations().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int maximumScore(int[] nums, int[] multipliers) {
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}